By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 16, Issue 4, pp. 939-1241

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials

Tae Roh and Lieven Vandenberghe

pp. 939-964

BibTeX  Abstract Full Text:  PDF

Incorporating Condition Measures in the Context of Combinatorial Optimization

Jorge R. Vera and Iván Derpich

pp. 965-985

BibTeX  Abstract Full Text:  PDF

Fast Algorithms for Projection on an Ellipsoid

Yu-Hong Dai

pp. 986-1006

BibTeX  Abstract Full Text:  PDF

A Proximal Bundle Method with Approximate Subgradient Linearizations

Krzysztof C. Kiwiel

pp. 1007-1023

BibTeX  Abstract Full Text:  PDF

Stochastic Order Relations and Lattices of Probability Measures

Alfred Müller and Marco Scarsini

pp. 1024-1043

BibTeX  Abstract Full Text:  PDF

Critical Value Functions have Finite Modulus of Concavity

Harald Günzel, Francisco Guerra Vazquez, and Hubertus Th. Jongen

pp. 1044-1053

BibTeX  Abstract Full Text:  PDF

A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems

G. Liuzzi, S. Lucidi, and M. Sciandrone

pp. 1054-1075

BibTeX  Abstract Full Text:  PDF

LMI Approximations for Cones of Positive Semidefinite Forms

Luis F. Zuluaga, Juan Vera, and Javier Peña

pp. 1076-1091

BibTeX  Abstract Full Text:  PDF

A New Notion of Weighted Centers for Semidefinite Programming

Chek Beng Chua

pp. 1092-1109

BibTeX  Abstract Full Text:  PDF

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

C. Roos

pp. 1110-1136

BibTeX  Abstract Full Text:  PDF

A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming

Qin Ni, Chen Ling, Liqun Qi, and Kok Lay Teo

pp. 1137-1154

BibTeX  Abstract Full Text:  PDF

Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks

A. Fügenschuh, M. Herty, A. Klar, and A. Martin

pp. 1155-1176

BibTeX  Abstract Full Text:  PDF

A SQP-Semismooth Newton-type Algorithm applied to Control of the instationary Navier--Stokes System Subject to Control Constraints

M. Hintermüller and M. Hinze

pp. 1177-1200

BibTeX  Abstract Full Text:  PDF

Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints

Moritz Diehl, Florian Jarre, and Christoph H. Vogelbusch

pp. 1201-1210

BibTeX  Abstract Full Text:  PDF

Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

Bharath Kumar Rangarajan

pp. 1211-1229

BibTeX  Abstract Full Text:  PDF

Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings

Natalia Nadezhkina and Wataru Takahashi

pp. 1230-1241

BibTeX  Abstract Full Text:  PDF